On generalised free products of torsion-free nilpotent groups I
نویسندگان
چکیده
منابع مشابه
The isomorphism problem for residually torsion-free nilpotent groups
Both the conjugacy and isomorphism problems for finitely generated nilpotent groups are recursively solvable. In some recent work, the first author, with a tiny modification of work in the second author’s thesis, proved that the conjugacy problem for finitely presented, residually torsion-free nilpotent groups is recursively unsolvable. Here we complete the algorithmic picture by proving that t...
متن کاملOn Generalised Free Products of Conjugacy Separable Groups
In this paper we prove that a free product of conjugacy separable groups A and B, amalgamating a cyclic subgroup, is conjugacy separable if A and B are subgroup separable, cyclic conjugacy separable, 2-free, and residually p-finite, for all prime numbers p. The following result is an example of the applications we obtain as consequences of our main theorem. Let A and B each be a free product of...
متن کاملOn Torsion-by-Nilpotent Groups
Let C be a class of groups, closed under taking subgroups and quotients. We prove that if all metabelian groups of C are torsion-by-nilpotent, then all soluble groups of C are torsion-by-nilpotent. From that, we deduce the following consequence, similar to a well-known result of P. Hall: if H is a normal subgroup of a group G such that H and G/H ′ are (locally finite)-by-nilpotent, then G is (l...
متن کاملOn Endomorphisms of torsion-Free hyperbolic Groups
Let H be a torsion-free δ-hyperbolic group with respect to a finite generating set S. Let g1, . . . , gn and g1∗, . . . , gn∗ be elements of H such that gr∗ is conjugate to gr for each r = 1, . . . , n. There is a uniform conjugator if and only if W (g1∗, . . . , gn∗) is conjugate to W (g1, . . . , gn) for every word W in n variables and length up to a computable constant depending only on δ, ♯...
متن کاملOn the Dimension of Matrix Representations of Finitely Generated Torsion Free Nilpotent Groups
It is well known that any polycyclic group, and hence any finitely generated nilpotent group, can be embedded into GLn(Z) for an appropriate n ∈ N; that is, each element in the group has a unique matrix representation. An algorithm to determine this embedding was presented in [6]. In this paper, we determine the complexity of the crux of the algorithm and the dimension of the matrices produced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1972
ISSN: 0019-2082
DOI: 10.1215/ijm/1256065776